Optimal Simulations in Reconfigurable Arrays
نویسندگان
چکیده
There are several reconfiguring models of parallel computation that are considered in the published literature, depending on their switching capabilities. Three of the more popular ones are the Horizontal-Vertical Reconfigurable Mesh (HV-RN model) [LM89a, LM89b, ML89], the Linear Reconfigurable Mesh (LRN model) [MPRS87, BPRS91], and the General Reconfigurable Mesh (RN model) [Wan91, Sch91]. Can these reconfigurable models (in particular two dimensional arrays) be the basis for the design of massively parallel computers? Perhaps the most basic related question is: given an algorithm which is designed for a large reconfigurable mesh, can it be executed efficiently on a smaller reconfigurable mesh? We call it the simulation problem. Despite the fact that machines already exist and a large number of efficient algorithms are known for reconfigurable arrays, this question was left open for all reconfiguring models of computation. In this work we give several positive answers to the simulation problem. We have the following results for the simulation of an n x n reconfiguring mesh by the p X P reconfiguring mesh. (1) Using standard techniques the simulation in the HV-RN model is carried optimally with slowdown 8«n/p)2). (2) Although using the same method fails for the LRN model, a novel technique is developed, achieving asymptotically optimal simulation of LRN meshes, with slowdown 8«n/p)2). (3) Efficient simulations in the RN model is achieved too, paying an extra factor which is polylogarithmicin the size of the simulated mesh. The slowdown achieved is O«n/p)210gnlog(n/p)). Although the simulation algorithms are complex and require extensive bookkeeping operations, the required space is asymptotically optimal. In addition to the above we give a bunch of inter-model simulation results. These results give some additional insight into the gap in the computational power of the various reconfiguring models [Sch91, BPS91]. ·Department of Mathematics and Computer Science, University of Haifa, Haifa. 31905, Isra.el. E-mail: [email protected] 'Department of Mathematics and Computer Science, University of Haifa, Haifa 31905, Israel. E-mail: [email protected] l(CONTACT AUTHOR:) Department of Computer Science, Technion, Technion City, Haifa 32000, Israel. E-mail: [email protected] . aifa.a
منابع مشابه
Optimal Reconfiguration of Solar Photovoltaic Arrays Using a Fast Parallelized Particle Swarm Optimization in Confront of Partial Shading
Partial shading reduces the power output of solar modules, generates several peak points in P-V and I-V curves and shortens the expected life cycle of inverters and solar panels. Electrical array reconfiguration of PV arrays that is based on changing the electrical connections with switching devices, can be used as a practical solution to prevent such problems. Valuable studies have been perfor...
متن کاملA maintenance system model for optimal reconfigurable vibrating screen management
The reconfigurable vibrating screen (RVS) machine is an innovative beneficiation machine designed for screening different mineral particles of varying sizes and volumes required by the customers’ through the geometric transformation of its screen structure. The successful RVS machine upkeep requires its continuous, availability, reliability and maintainability. The RVS machine downtime, which c...
متن کاملOptimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus. Specifically, for any P N, our algorithm routes any permutation of N elements on a P-processor model optimally in O( P) steps. This algorithm extends naturally to one for routing h-relations optimally in O(h) steps. ...
متن کاملImproved Optimal Shared Memory Simulations, and the Power of Reconfiguration
W e present time-processor optimal randomized algorithms for simulating a shared memory machine ( E R E W P R A M ) on a distributed memory machine (DMM). The first algorithm simulates each step of an n-processor E R E W P R A M on an n-processor DMM with O( l ~ ~ ~ ~ ~ o ~ n ) delay with high probability. This simulation is work optimal and can be made timeprocessor optimal. The best previous ...
متن کاملEffective Partitioning of Static Global Buses for Small Processor Arrays
This paper shows an effective partitioning of static global row/column buses for tightly coupled 2D mesh-connected small processor arrays (“mesh”, for short). With additional O(n/m (n/m + log m)) time slowdown, it enables the mesh of size m×m with static row/column buses to simulate the mesh of the larger size n×n with reconfigurable row/column buses (m ≤ n). This means that if a problem can be...
متن کامل